n = int(input())
for i in range(n):
p, a, b, c = map(int,input().split())
a1 = a - ((p-1) % a +1)
b1 = b - ((p-1) % b +1)
c1 = c - ((p-1) % c +1)
print(min(a1,b1,c1))
#include <iostream>
#include <string>
#include <cmath>
#include <utility>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <algorithm>
#include <iterator>
#include <fstream>
#define ll long long
#define stream stringstream
#define bismillah ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
#define testcase ll t; cin>>t; while(t--)
using namespace std;
int main() {
bismillah;
testcase
{
ll p,a,b,c; cin >> p >> a >> b >> c;
a = (p % a == 0 ? 0 : a - (p % a));
b = (p % b == 0 ? 0 : b - (p % b));
c = (p % c == 0 ? 0 : c - (p % c));
ll m = min(a,min(b,c));
cout << m << endl;
}
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |